package 队列;

import java.math.BigDecimal;
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.*;

public class 剑指Offer09用两个栈实现队列 {

    /**
     * 用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，
     * 分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，deleteHead 操作返回 -1 )
     *
     * 示例 1：
     * 输入：
     * ["CQueue","appendTail","deleteHead","deleteHead"]
     * [[],[3],[],[]]
     * 输出：[null,null,3,-1]
     * 示例 2：
     * 输入：
     * ["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
     * [[],[],[5],[2],[],[]]
     * 输出：[null,-1,null,null,5,2]
     * 提示：
     * 1 <= values <= 10000
     * 最多会对 appendTail、deleteHead 进行 10000 次调用
     */

    class CQueue {

        Deque<Integer> stack1=new ArrayDeque<>();
        Deque<Integer> stack2=new ArrayDeque<>();

        public CQueue() {

        }

        public void appendTail(int value) {
            stack1.addLast(value);
        }

        public int deleteHead() {

            if(!stack2.isEmpty()){
                return stack2.removeLast();
            }

            while (!stack1.isEmpty()){
                stack2.addLast(stack1.removeLast());
            }

            return stack2.isEmpty()?-1:stack2.removeLast();
        }

    }

    public static void main(String[] args){
        Scanner input=new Scanner(System.in);
        while(input.hasNext()){
            int start=input.nextInt();
            int end=input.nextInt();
            StringBuilder sb=new StringBuilder();
            for(int i=start;i<=end;i++){

                int one=i/100;
                int two=(i-(one*100))/10;
                int three=(i-(one*100)-(two*10));
                if(Math.pow(one,3)+Math.pow(two,3)+Math.pow(three,3)==i){
                    sb.append(i).append(" ");
                }

            }
            if(sb.length()==0){
                System.out.println("no");
            }else{
                sb.delete(sb.length()-1,sb.length());
                System.out.println(sb.toString());
            }
        }
    }

}
